A Practical Algorithm for Finding Matrix Representations for Polycyclic Groups
نویسندگان
چکیده
We describe a new algorithm for nding matrix representations for polycyclic groups given by nite presentations. In contrast to previous algorithms, our algorithm is e cient enough to construct representations for some interesting examples. The examples which we studied included a collection of free nilpotent groups, and our results here led us to a theoretical result concerning such groups.
منابع مشابه
Practical Algorithms for Polycyclic Matrix Groups
Many fundamental problems are undecidable for in nite matrix groups. Polycyclic matrix groups represent a large class of groups for which these same problems are known to be decidable. In this paper we describe a suite of new algorithms for studying polycyclic matrix groups | algorithms for testing membership and for uncovering the polycyclic structure of the group. We also describe an algorith...
متن کاملOn the Dimension of Matrix Representations of Finitely Generated Torsion Free Nilpotent Groups
It is well known that any polycyclic group, and hence any finitely generated nilpotent group, can be embedded into GLn(Z) for an appropriate n ∈ N; that is, each element in the group has a unique matrix representation. An algorithm to determine this embedding was presented in [6]. In this paper, we determine the complexity of the crux of the algorithm and the dimension of the matrices produced ...
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...
متن کاملAN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX
The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...
متن کاملOn the orbit-stabilizer problem for integral matrix actions of polycyclic groups
We present an algorithm to solve the orbit-stabilizer problem for a polycyclic group G acting as a subgroup of GL(d,Z) on the elements of Qd. We report on an implementation of our method and use this to observe that the algorithm is practical.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 28 شماره
صفحات -
تاریخ انتشار 1999